A dense planar point set from iterated line intersections
نویسندگان
چکیده
Given S1, a starting set of points in the plane, not all on a line, we define a sequence of planar point sets {Si}∞i=1 as follows. With Si already determined, let Li be the set of all the lines determined by pairs of points from Si , and let Si+1 be the set of all the intersection points of lines in Li . We show that with the exception of some very particular starting configurations, the limiting point set ⋃∞ i=1 Si is everywhere dense in the plane. 2003 Elsevier B.V. All rights reserved.
منابع مشابه
On the density of iterated line segment intersections
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting pairs of points of ⋃i j=1 Sj , and let Si+1 be the set of intersection points of those line segments in Li, which cross but do not overlap. We show that with the exception of some starting configurations the set of all...
متن کاملA result about the density of iterated line intersections in the plane
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configurations of points S such that iteration of the above operation produces a dense set. We also discuss partial results on the characterization of those finite point-sets with rational coordinates that generate all of Q ...
متن کاملChaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملOn the stabbing number of a random Delaunay triangulation
We consider a Delaunay triangulation defined on n points distributed independently and uniformly on a planar compact convex set of positive volume. Let the stabbing number be the maximal number of intersections between a line and edges of the triangulation. We show that the stabbing number Sn is Θ( √ n) in the mean, and provide tail bounds for P{Sn ≥ t √ n}. Applications to planar point locatio...
متن کاملTransdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
Given a planar subdivision whose coordinates are integers bounded by U ≤ 2, we present a linear-space data structure that can answer point location queries in O(min{lgn/ lg lg n,√lgU/ lg lgU}) time on the unit-cost RAM with word size w. This is the first result to beat the standard Θ(lgn) bound for infinite precision models. As a consequence, we obtain the first o(n lgn) (randomized) algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 27 شماره
صفحات -
تاریخ انتشار 2004